翻訳と辞書
Words near each other
・ "O" Is for Outlaw
・ "O"-Jung.Ban.Hap.
・ "Ode-to-Napoleon" hexachord
・ "Oh Yeah!" Live
・ "Our Contemporary" regional art exhibition (Leningrad, 1975)
・ "P" Is for Peril
・ "Pimpernel" Smith
・ "Polish death camp" controversy
・ "Pro knigi" ("About books")
・ "Prosopa" Greek Television Awards
・ "Pussy Cats" Starring the Walkmen
・ "Q" Is for Quarry
・ "R" Is for Ricochet
・ "R" The King (2016 film)
・ "Rags" Ragland
・ ! (album)
・ ! (disambiguation)
・ !!
・ !!!
・ !!! (album)
・ !!Destroy-Oh-Boy!!
・ !Action Pact!
・ !Arriba! La Pachanga
・ !Hero
・ !Hero (album)
・ !Kung language
・ !Oka Tokat
・ !PAUS3
・ !T.O.O.H.!
・ !Women Art Revolution


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

proximity space : ウィキペディア英語版
proximity space

In topology, a proximity space, also called a nearness space, is an axiomatization of notions of "nearness" that hold set-to-set, as opposed to the better known point-to-set notions that characterize topological spaces.
The concept was described by but ignored at the time. It was rediscovered and axiomatized by V. A. Efremovič in 1934 under the name of infinitesimal space, but not published until 1951. In the interim, discovered a version of the same concept under the name of separation space.
Definition A proximity space (''X'', δ) is a set ''X'' with a relation δ between subsets of ''X'' satisfying the following properties:
For all subsets ''A'', ''B'' and ''C'' of ''X''
# ''A'' δ ''B'' ⇒ ''B'' δ ''A''
# ''A'' δ ''B'' ⇒ ''A'' ≠ ø
# ''A''∩''B'' ≠ ø ⇒ ''A'' δ ''B''
# ''A'' δ (''B''∪''C'') ⇔ (''A'' δ ''B'' or ''A'' δ ''C'')
# (∀''E'', ''A'' δ ''E'' or ''B'' δ (''X''−''E'')) ⇒ ''A'' δ ''B''
Proximity without the first axiom is called quasi-proximity (but then Axioms 2 and 4 must be stated in a two-sided fashion).
If ''A'' δ ''B'' we say ''A'' is near ''B'' or ''A'' and ''B'' are proximal; otherwise we say ''A'' and ''B'' are apart. We say ''B'' is a proximal or δ-neighborhood of ''A'', written ''A'' « ''B'', if and only if ''A'' and ''X''−''B'' are apart.
The main properties of this set neighborhood relation, listed below, provide an alternative axiomatic characterization of proximity spaces.
For all subsets ''A'', ''B'', ''C'', and ''D'' of ''X''
# ''X'' « ''X''
# ''A'' « ''B'' ⇒ ''A'' ⊆ ''B''
# ''A'' ⊆ ''B'' « ''C'' ⊆ ''D'' ⇒ ''A'' « ''D''
# (''A'' « ''B'' and ''A'' « ''C'') ⇒ ''A'' « ''B''∩''C''
# ''A'' « ''B'' ⇒ ''X''−''B'' « ''X''−''A''
# ''A'' « ''B'' ⇒ ∃''E'', ''A'' « ''E'' « ''B''.
A proximity space is called ''separated'' if δ implies ''x'' = ''y''.
A ''proximity'' or ''proximal map'' is one that preserves nearness, that is, given ''f'':(''X'',δ) → (''X''
*,δ
*), if ''A'' δ ''B'' in ''X'', then ''f''() δ
* ''f''() in ''X''
*. Equivalently, a map is proximal if the inverse map preserves proximal neighborhoodness. In the same notation, this means if ''C'' «
* ''D'' holds in ''X''
*, then ''f''−1() « ''f''−1() holds in ''X''.
Given a proximity space, one can define a topology by letting ''A'' ↦ be a Kuratowski closure operator. If the proximity space is separated, the resulting topology is Hausdorff. Proximity maps will be continuous between the induced topologies.
The resulting topology is always completely regular. This can be proven by imitating the usual proofs of Urysohn's lemma, using the last property of proximal neighborhoods to create the infinite increasing chain used in proving the lemma.
Given a compact Hausdorff space, there is a unique proximity whose corresponding topology is the given topology: ''A'' is near ''B'' if and only if their closures intersect. More generally, proximities classify the compactifications of a completely regular Hausdorff space.
A uniform space X induces a proximity relation by declaring ''A'' is near ''B'' if and only if ''A''×''B'' has nonempty intersection with every entourage. Uniformly continuous maps will then be proximally continuous.
== References ==

*
*
*
*
*

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「proximity space」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.